ar X iv : 1 30 3 . 11 44 v 1 [ cs . I T ] 5 M ar 2 01 3 1 Recursive Sparse Recovery in Large but Structured Noise – Part 2
نویسنده
چکیده
We study the problem of recursively recovering a time sequence of sparse vectors, St, from measurements Mt := St + Lt that are corrupted by structured noise Lt which is dense and can have large magnitude. The structure that we require is that Lt should lie in a low dimensional subspace that is either fixed or changes “slowly enough”; and the eigenvalues of its covariance matrix are “clustered”. We do not assume any model on the sequence of sparse vectors. Their support sets and their nonzero element values may be either independent or correlated over time (usually in many applications they are correlated). The only thing required is that there be some support change every so often. We introduce a novel solution approach called Recursive Projected Compressive Sensing with cluster-PCA (ReProCS-cPCA) that addresses some of the limitations of earlier work. Under mild assumptions, we show that, with high probability, ReProCS-cPCA can exactly recover the support set of St at all times; and the reconstruction errors of both St and Lt are upper bounded by a time-invariant and small value.
منابع مشابه
Sample-Optimal Fourier Sampling in Any Constant Dimension - Part I
We give an algorithm for `2/`2 sparse recovery from Fourier measurements using O(k logN) samples, matching the lower bound of [DIPW10] for non-adaptive algorithms up to constant factors for any k ≤ N1−δ . The algorithm runs in Õ(N) time. Our algorithm extends to higher dimensions, leading to sample complexity of Od(k logN), which is optimal up to constant factors for any d = O(1). These are the...
متن کاملar X iv : h ep - t h / 01 03 09 3 v 1 1 3 M ar 2 00 1 Physical Aspects of the Space - Time Torsion
متن کامل
ar X iv : 1 70 5 . 07 33 9 v 1 [ cs . A I ] 2 0 M ay 2 01 7 Combining tabu search and graph reduction to solve the maximum balanced biclique problem
The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs fro...
متن کاملar X iv : 1 30 5 . 44 99 v 1 [ qu an t - ph ] 2 0 M ay 2 01 3 Control of decoherence with no control
Common philosophy in control theory is the control of disorder by order. It is not exceptional for strategies suppressing quantum decoherence. Here we predict an anomalous quantum phenomenon. Suppression of decoherence can be made via more disordered white noise field, in particular white Poissonian noise. The phenomenon seems to be another anomaly in quantum mechanics, and may offer a new stra...
متن کاملIntroduction to Judea Pearl's Do-Calculus
This is a purely pedagogical paper with no new results. The goal of the paper is to give a fairly self-contained introduction to Judea Pearl’s do-calculus, including proofs of his 3 rules. 1 ar X iv :1 30 5. 55 06 v1 [ cs .A I] 2 6 A pr 2 01 3
متن کامل